Constant sum partition of sets of integers and distance magic graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero-Sum Magic Labelings and Null Sets of Regular Graphs

For every h ∈ N, a graph G with the vertex set V (G) and the edge set E(G) is said to be h-magic if there exists a labeling l : E(G) → Zh\{0} such that the induced vertex labeling s : V (G) → Zh, defined by s(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is zero, we say that G admits a zero-sum h-magic labeling. The null set of a graph G, denoted by N(G), is the set of all natural ...

متن کامل

Zero-Sum Magic and Null Sets of Planar Graphs

For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l : V (G) → Zh defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h ∈ N for which G admits a zero-sum h-magic labeling. A graph G is said to b...

متن کامل

Sum-free Sets of Integers

A set S of integers is said to be sum-free if a, b e 5 implies a + b 6 S. In this paper, we investigate two new problems on sum-free sets: (1) Let f(k) denote the largest positive integer for which there exists a partition of (1, 2,... ,f(k)) into k sum-free sets, and let h(k) denote the largest positive integer for which there exists a partition of {1, 2, . . . , h(k)) into k sets which are su...

متن کامل

On Zero-sum Magic Graphs and Their Null Sets

For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh−{0} such that the induced vertex labeling l+ : V (G) → Zh defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h ∈ N for which G admits a zero-sum h-magic labeling. A graph G is said to be...

متن کامل

Zero-Sum Magic Graphs And Their Null Sets

For any h ∈ IN , a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → ZZ h − {0} such that the induced vertex set labeling l : V (G) → ZZ h defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h ∈ IN for which G admits a zero-sum h-magic labeling. In this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discussiones Mathematicae Graph Theory

سال: 2018

ISSN: 1234-3099,2083-5892

DOI: 10.7151/dmgt.1991